Поиск по сайту

Information

По вашему запросу найдено материалов: 1
Искать:
Bykova V. V. «Computational aspects of graph treewidth» // 2011. №3(13) C.65-79
Bykova V. V. «FPT-algorithms on graphs of limited treewidth» // 2012. №2(16) C.65-78
Davidovsky M. V., Kurapov S. V. «Planarity testing and constructing the topological drawing of a plane graph (DFS)» // Applied Discrete Mathematics 2016. №2(32) C.100-114
Kirillov Y. I., Bykova V. V. «Calculation of upper bounds for graph vertex integrity based on the minimal separators» // Applied Discrete Mathematics. Supplement 2015. №8 C.142-144
Bykova V. V. «Structural decomposition of graphs and its application for solving optimization problems on sparse graphs» // Applied Discrete Mathematics 2014. №7 (Приложение) C.154-157